Time Hierarchies for Computations with a Bit of Advice
نویسنده
چکیده
A polynomial time hierarchy for ZPTime with one bit of advice is proved. That is for any constants a and b such that 1 < a < b, ZPTime[n]/1 ( ZPTime[n]/1. The technique introduced in this paper is very general and gives the same hierarchy for NTime∩coNTime, UTime, MATime, AMTime and BQTime. It also significantly simplifies the previously known proofs of hierarchies for BPTime and RPTime with advice.
منابع مشابه
The University of Chicago Hierarchy Theorems and Resource Tradeoffs for Semantic Classes a Dissertation Submitted to the Faculty of the Division of the Physical Sciences in Candidacy for the Degree of Doctor of Philosophy Department of Computer Science By
Computational complexity theory studies the minimum resources (time, space, randomness etc.) to solve computational problems. Two fundamental questions in this area are: 1. Can more problems be solved given more of a given resource? A positive answer to this question is known as a hierarchy theorem. 2. Can one resource be traded off with another when solving a given problem? Such a result is kn...
متن کاملA note on time hierarchies for reasonable semantic classes without advice
We show time hierarchies for reasonable semantic classes without advice by eliminating the constant bits of advice in previous results.The elimination is done by a contrapositive argument that for any reasonable computational model,let CTIME(f(n))/g(n) denote the set of all languages decide by machines running in time O(f(n)) with advice of g(n) bits in that model, if CTIME(t(n)) ⊆ CTIME(T (n))...
متن کاملApplication of modified balanced iterative reducing and clustering using hierarchies algorithm in parceling of brain performance using fMRI data
Introduction: Clustering of human brain is a very useful tool for diagnosis, treatment, and tracking of brain tumors. There are several methods in this category in order to do this. In this study, modified balanced iterative reducing and clustering using hierarchies (m-BIRCH) was introduced for brain activation clustering. This algorithm has an appropriate speed and good scalability in dealing ...
متن کاملبررسی موارد ترخیص با رضایت شخصی در بیماران مبتلا به اختلالات روان پزشکی و علل مرتبط با آن
Background and purpose: Leaving the hospital against physician advice is associated with negative consequences. The aim of this study was to investigate the prevalence of discharge against medical advice in a psychiatric hospital and factors associated with this decision. Materials and methods: The study was conducted using the records of 1112 patients admitted to Sari Zere Hospital, Iran betw...
متن کاملHigh-speed All- Optical Time Division Multiplexed Node
In future high-speed self-routing photonic networks based on all-optical time division multiplexing (OTDM) it is highly desirable to carry out packet switching, clock recovery and demultplexing in the optical domain in order to avoid the bottleneck due to the optoelectronics conversion. In this paper we propose a self-routing OTDM node structure composed of an all-optical router and demultiplex...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Electronic Colloquium on Computational Complexity (ECCC)
دوره شماره
صفحات -
تاریخ انتشار 2005